The joint weight enumerator of an LCD code and its dual

نویسندگان

  • Adel Alahmadi
  • Michel Deza
  • Mathieu Dutour Sikiric
  • Patrick Solé
چکیده

A binary linear code is called LCD if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on the size of an LCD code of given length and minimum distance. In addition, we show that this polynomial is, in general, an invariant of a matrix group of dimension 4 and order 12. Also, we sketch a Gleason formula for this weight enumerator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Joint Weight Enumerators and Siegel Modular Forms

The weight enumerator of a binary doubly even self-dual code is an isobaric polynomial in the two generators of the ring of invariants of a certain group of order 192. The aim of this note is to study the ring of coefficients of that polynomial, both for standard and joint weight enumerators.

متن کامل

LCD codes over ${\mathbb F}_q $ are as good as linear codes for q at least four

The hull H(C) of a linear code C is defined by H(C) = C ∩ C⊥. A linear code with a complementary dual (LCD) is a linear code with H(C) = {0}. The dimension of the hull of a code is an invariant under permutation equivalence. For binary and ternary codes the dimension of the hull is also invariant under monomial equivalence and we show that this invariant is determined by the extended weight enu...

متن کامل

Rational Point Counts for del Pezzo Surfaces over Finite Fields and Coding Theory

The goal of this thesis is to apply an approach due to Elkies to study the distribution of rational point counts for certain families of curves and surfaces over finite fields. A vector space of polynomials over a fixed finite field Fq gives rise to a linear code, and the weight enumerator of this code gives information about point count distributions. The MacWilliams theorem gives a relation b...

متن کامل

Classification of the extremal formally self-dual even codes of length 30

Throughout this paper all codes are assumed to be binary. A linear code C is formally self-dual (fsd) if C and its dual C have the same weight enumerator. While self-dual codes contain only even weight vectors, formally self-dual codes may contain odd weight codewords as well. Many authors consider only even formally self-dual codes because their weight enumerators are combinations of Gleason p...

متن کامل

THE AUTOMORPHISM GROUP OF AN [l&9,8] QUATERNARY CODE

An [18,9,8] code Ce18 over GF(4) was constructed in [6] as an extended cyclic code, and Pless [9] describes the same code as an extended “Q-code”. This code is of particular interest since it is an extremal quaternary code: an [n, n/2, d] self-dual code with d = 2[n/6] + 2 ([6, p. 2951, [3, p. 2051). In the present note we give new coordinates for this code, enabling us to find a simple descrip...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1511.08889  شماره 

صفحات  -

تاریخ انتشار 2015